Determinants and polynomial root structure
نویسنده
چکیده
A little known property of determinants is developed in a manner accessible to beginning undergraduates in linear algebra. Using the language of matrix theory, a classical result by Sylvester that describes when two polynomials have a common root is recaptured. Among results concerning the structure of polynomial roots, polynomials with pairs of roots that are either multiplicative inverses or additive inverses are completely characterized.
منابع مشابه
On the Order of Convergence of a Determinantal Family of Root-finding Methods
For each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-nding iteration function, deened as the ratio of two determinants that depend on the rst m ? k derivatives of the given function, and for k = 1 are Toeplitz determinants. In this paper we analyze the order of convergence of this fundamental family. For xed m, as k increases, the or...
متن کاملApproximation of Polynomial Root Using a Single Input and the Corresponding Derivative Values
A new formula for the approximation of root of polynomials with complex coefficients is presented. For each simple root there exists a neighborhood such that given any input within this neighborhood, the formula generates a convergent sequence, computed via elementary operations on the input and the corresponding derivative values. Each element of the sequence is defined in terms of the quotien...
متن کاملApproximation of the n-th Root of a Fuzzy Number by Polynomial Form Fuzzy Numbers
In this paper we introduce the root of a fuzzy number, and we present aniterative method to nd it, numerically. We present an algorithm to generatea sequence that can be converged to n-th root of a fuzzy number.
متن کاملDown with Determinants!
Ask anyone why a square matrix of complex numbers has an eigenvalue, and you’ll probably get the wrong answer, which goes something like this: The characteristic polynomial of the matrix—which is defined via determinants—has a root (by the fundamental theorem of algebra); this root is an eigenvalue of the matrix. What’s wrong with that answer? It depends upon determinants, that’s what. Determin...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کامل